An Iterative Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channels
نویسنده
چکیده
An iterative decoding algorithm of low density parity check(LDPC) codes for hidden Markov noise channels is presented. The hidden Markov noise channel is an additive noise channel whose noise statistics is modeled by a hidden Markov model(HMM). The proposed decoding algorithm consists of two parts: the conventional sum-product algorithm for the LDPC codes and a forward-backward likelihood estimation algorithm for the HMM. For some channel parameters, it is observed that the proposed algorithm can correct burst errors far beyond the random error correcting capability of
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملLow-density parity-check codes on Markov channels
Low-density parity-check codes are studied over Markov channels with time-varying gaussian or bit-flipping noise. The belief propagation decoding algorithm is extended to include channel estimation and the gains this extension produce are experimentally determined.
متن کاملDecoding Ldpc Codes over Binary Channels with Additive Markov Noise
We study the design of a belief propagation decoder for lowdensity parity check (LDPC) codes over binary channels with additive M th-order Markov noise, specifically the queuebased channel (QBC) [1]. The decoder is an extension of the sum product algorithm (SPA) for the case of memoryless channels and is similar to the one developed for the GilbertElliot channel [2, 3, 4]. Simulation results of...
متن کاملAn Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise
In this paper, an iterative decoding algorithm for channels with additive linear dynamical noise is presented. The proposed algorithm is based on the tightly coupled two inference algorithms: the sum-product algorithm which infers the information symbols of an low density parity check(LDPC) code and the Kalman smoothing algorithm which infers the channel states. The linear dynamical noise are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000